Translation of LTL to -Automata
نویسنده
چکیده
منابع مشابه
Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F, G)-Fragment
Some applications of linear temporal logic (LTL) require to translate formulae of the logic to deterministic ω-automata. There are currently two translators producing deterministic automata: ltl2dstar working for the whole LTL and Rabinizer applicable to LTL(F,G) which is the LTL fragment using only modalities F and G. We present a new translation to deterministic Rabin automata via alternating...
متن کاملDeeper Connections Between LTL and Alternating Automata
It is known that Linear Temporal Logic (LTL) has the same expressive power as alternating 1-weak automata (A1W automata, also called alternating linear automata or very weak alternating automata). A translation of LTL formulae into a language equivalent A1W automata has been introduced in [MSS88]. The inverse translation has been developed independently in [Roh97] and [LT00]. We improve the lat...
متن کاملFrom PSL to LTL: A Formal Validation in HOL
Using the HOL theorem prover, we proved the correctness of a translation from a subset of Accellera’s property specification language PSL to linear temporal logic LTL. Moreover, we extended the temporal logic hierarchy of LTL that distinguishes between safety, liveness, and more difficult properties to PSL. The combination of the translation from PSL to LTL with already available translations f...
متن کاملOptimal Translation of LTL to Limit Deterministic Automata
A crucial step in model checking Markov Decision Processes (MDP) is to translate the LTL specification into automata. Efforts have been made in improving deterministic automata construction for LTL but such translations are double exponential in the worst case. For model checking MDPs though limit deterministic automata suffice. Recently it was shown how to translate the fragment LTL\GU to expo...
متن کاملGenerating Deterministic ω-Automata for most LTL Formulas by the Breakpoint Construction
Temporal logics like LTL are frequently used for the specification and verification of reactive systems. To this end, LTL formulas are typically translated to nondeterministic Büchi automata so that the LTL verification problem is reduced to a nonemptiness problem of ω-automata. While nondeterministic automata are sufficient for this purpose, many other applications require deterministic ω-auto...
متن کاملThe Blowup in Translating LTL to Deterministic Automata
The translation of LTL formulas to nondeterministic automata involves an exponential blow-up, and so does the translation of nondeterministic automata to deterministic ones. This yields a 2 O(n) upper bound for the translation of LTL to deterministic automata. A lower bound for the translation was studied in [KV05a], which describes a 2 Ω( √ n) lower bound, leaving the problem of the exact blow...
متن کامل